The competition-common enemy graph of a digraph
نویسنده
چکیده
The competit ion graph of a digraph was first defined in 1968 by Cohen in the study of ecosystems. The competition graph essentially relates any two species which have a common prey. In this paper, a compet i t ion-common enemy graph of a digraph is defined and studied. As the term suggests, it relates any two species which have a common prey and a common enemy. Results analogous to those found for competition graphs are obtained.
منابع مشابه
The niche graphs of interval orders
The niche graph of a digraph D is the (simple undirected) graph which has the same vertex set as D and has an edge between two distinct vertices x and y if and only if N D (x)∩N + D (y) 6= ∅ or N − D (x)∩ N D (y) 6= ∅, where N + D (x) (resp. N − D (x)) is the set of out-neighbors (resp. in-neighbors) of x in D. A digraph D = (V,A) is called a semiorder (or a unit interval order) if there exist ...
متن کاملThe double competition multigraph of a digraph
The competition graph of a digraph is defined to be the intersection graph of the family of the out-neighborhoods of the vertices of the digraph (see [6] for intersection graphs). A digraph D is a pair (V (D), A(D)) of a set V (D) of vertices and a set A(D) of ordered pairs of vertices, called arcs. An arc of the form (v, v) is called a loop. For a vertex x in a digraph D, we denote the out-nei...
متن کاملOn CCE graphs of doubly partial orders
Let D be a digraph. The competition-common enemy graph (CCE graph) of D has the same set of vertices as D and an edge between vertices u and v if and only if there are vertices w and x in D such that (w, u), (w, v), (u, x), and (v, x) are arcs of D. We call a graph a CCE graph if it is the CCE graph of some digraph. In this paper, we show that if the CCE graph of a doubly partial order does not...
متن کاملCoincidence points and common fixed points for hybrid pair of mappings in b-metric spaces endowed with a graph
In this paper, we introduce the notion of strictly (α,ψ,ξ)-G-contractive mappings in b-metric spaces endowed with a graph G. We establish a sufficient condition for existence and uniqueness of points of coincidence and common fixed points for such mappings. Our results extend and unify many existing results in the literature. Finally, we construct some examples to analyze and support our results.
متن کاملCommon fixed point results for graph preserving mappings in parametric $N_b$-metric spaces
In this paper, we discuss the existence and uniqueness of points of coincidence and common fixed points for a pair of graph preserving mappings in parametric $N_b$-metric spaces. As some consequences of this study, we obtain several important results in parametric $b$-metric spaces, parametric $S$-metric spaces and parametric $A$-metric spaces. Finally, we provide some illustrative examples to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 17 شماره
صفحات -
تاریخ انتشار 1987